HashMap compared insert/std::collections::HashMap
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.8924 ms | 1.8958 ms | 1.8992 ms |
| R² | 0.9925080 | 0.9929499 | 0.9925133 |
| Mean | 1.8927 ms | 1.8953 ms | 1.8979 ms |
| Std. Dev. | 11.227 µs | 13.394 µs | 15.320 µs |
| Median | 1.8918 ms | 1.8931 ms | 1.8951 ms |
| MAD | 5.7376 µs | 8.1577 µs | 13.546 µs |
Understanding this report:
The plot on the left displays the average time per iteration for this benchmark. The shaded region shows the estimated probability of an iteration taking a certain amount of time, while the line shows the mean. Click on the plot for a larger view showing the outliers.
The plot on the right shows the linear regression calculated from the measurements. Each point represents a sample, though here it shows the total time for the sample rather than time per iteration. The line is the line of best fit for these measurements.
See the documentation for more details on the additional statistics.